The partition–combination method for recognition of handwritten characters∗
Identifieur interne : 001C44 ( Main/Exploration ); précédent : 001C43; suivant : 001C45The partition–combination method for recognition of handwritten characters∗
Auteurs : Z.-C. Li [Taïwan, République populaire de Chine] ; C. Y. SuenSource :
- Pattern Recognition Letters [ 0167-8655 ] ; 1999.
Abstract
The partition–combination method is a universal strategy for studying all sciences. This paper introduces such a strategy to handwritten character recognition, which is developed from our previous study. Let a pattern be split into sub-patterns, or called parts, bases, roots, etc. The easier part recognition is first carried out, then recognition of the entire pattern can be completed by integrating the results of part recognition. In this paper, the computational formulas for evaluating the recognition rates of parts and their combinations are derived, and a number of fascinating results have been reported. Many new combinations of parts have been found, leading to better recognition in practical applications. Numerical experiments have also been conducted using 89 patterns of the most frequently used alphanumeric handprints, leading to the discovery of several interesting aspects related to character recognition. Furthermore, human behavior in handwriting may be discovered based on the computational data obtained from the new algorithms.
Url:
DOI: 10.1016/S0167-8655(00)00037-4
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001244
- to stream Istex, to step Curation: 001169
- to stream Istex, to step Checkpoint: 001246
- to stream Main, to step Merge: 001D43
- to stream Main, to step Curation: 001C44
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>The partition–combination method for recognition of handwritten characters∗</title><author><name sortKey="Li, Z C" sort="Li, Z C" uniqKey="Li Z" first="Z.-C." last="Li">Z.-C. Li</name></author><author><name sortKey="Suen, C Y" sort="Suen, C Y" uniqKey="Suen C" first="C. Y." last="Suen">C. Y. Suen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:54E14EB66E9F85DCFD812D7D87AC1A3CB073295B</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1016/S0167-8655(00)00037-4</idno><idno type="url">https://api.istex.fr/document/54E14EB66E9F85DCFD812D7D87AC1A3CB073295B/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001244</idno><idno type="wicri:Area/Istex/Curation">001169</idno><idno type="wicri:Area/Istex/Checkpoint">001246</idno><idno type="wicri:doubleKey">0167-8655:2000:Li Z:the:partition:combination</idno><idno type="wicri:Area/Main/Merge">001D43</idno><idno type="wicri:Area/Main/Curation">001C44</idno><idno type="wicri:Area/Main/Exploration">001C44</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">The partition–combination method for recognition of handwritten characters∗</title><author><name sortKey="Li, Z C" sort="Li, Z C" uniqKey="Li Z" first="Z.-C." last="Li">Z.-C. Li</name><affiliation wicri:level="1"><country wicri:rule="url">Taïwan</country></affiliation><affiliation wicri:level="1"><country xml:lang="fr" wicri:curation="lc">République populaire de Chine</country><wicri:regionArea>Department of Applied Mathematics, National Sun Yat-Sen University, Kaohsiung 80424, Taiwan</wicri:regionArea><wicri:noRegion>Taiwan</wicri:noRegion></affiliation></author><author><name sortKey="Suen, C Y" sort="Suen, C Y" uniqKey="Suen C" first="C. Y." last="Suen">C. Y. Suen</name><affiliation><wicri:noCountry code="subField">1M8</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition Letters</title><title level="j" type="abbrev">PATREC</title><idno type="ISSN">0167-8655</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1999">1999</date><biblScope unit="volume">21</biblScope><biblScope unit="issue">8</biblScope><biblScope unit="page" from="701">701</biblScope><biblScope unit="page" to="720">720</biblScope></imprint><idno type="ISSN">0167-8655</idno></series><idno type="istex">54E14EB66E9F85DCFD812D7D87AC1A3CB073295B</idno><idno type="DOI">10.1016/S0167-8655(00)00037-4</idno><idno type="PII">S0167-8655(00)00037-4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-8655</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The partition–combination method is a universal strategy for studying all sciences. This paper introduces such a strategy to handwritten character recognition, which is developed from our previous study. Let a pattern be split into sub-patterns, or called parts, bases, roots, etc. The easier part recognition is first carried out, then recognition of the entire pattern can be completed by integrating the results of part recognition. In this paper, the computational formulas for evaluating the recognition rates of parts and their combinations are derived, and a number of fascinating results have been reported. Many new combinations of parts have been found, leading to better recognition in practical applications. Numerical experiments have also been conducted using 89 patterns of the most frequently used alphanumeric handprints, leading to the discovery of several interesting aspects related to character recognition. Furthermore, human behavior in handwriting may be discovered based on the computational data obtained from the new algorithms.</div></front></TEI><affiliations><list><country><li>République populaire de Chine</li><li>Taïwan</li></country></list><tree><noCountry><name sortKey="Suen, C Y" sort="Suen, C Y" uniqKey="Suen C" first="C. Y." last="Suen">C. Y. Suen</name></noCountry><country name="Taïwan"><noRegion><name sortKey="Li, Z C" sort="Li, Z C" uniqKey="Li Z" first="Z.-C." last="Li">Z.-C. Li</name></noRegion></country><country name="République populaire de Chine"><noRegion><name sortKey="Li, Z C" sort="Li, Z C" uniqKey="Li Z" first="Z.-C." last="Li">Z.-C. Li</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001C44 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001C44 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:54E14EB66E9F85DCFD812D7D87AC1A3CB073295B
|texte= The partition–combination method for recognition of handwritten characters∗
}}
| This area was generated with Dilib version V0.6.32. |  |